package leetcode.greedy;

import leetcode.greedy.common.GreedyUtils;

class Solution1798 {
    public int getMaximumConsecutive(int[] coins) {
        return GreedyUtils.getMaximumConsecutive(coins);
    }
}

public class leetcode1798 {
    public static void main(String[] args) {
        Solution1798 solution1798 = new Solution1798();
        int[] coins = {1, 1, 1, 4};
        System.out.println(solution1798.getMaximumConsecutive(coins));
    }
}
